Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming
نویسندگان
چکیده
We develop algorithms capable of tackling robust black-box optimisation problems, where the number model runs is limited. When a desired solution cannot be implemented exactly aim to find one, worst case in an uncertainty neighbourhood around still performs well. To investigate improved methods we employ automatic generation approach: Grammar-Guided Genetic Programming. algorithmic building blocks Particle Swarm Optimisation framework, define rules for constructing heuristics from these components, and evolve populations search problems. Our combine elements existing techniques new features, resulting investigation novel heuristic space. obtain which improve upon current state art. also analyse component level breakdowns developed against their performance, identify high-performing components
منابع مشابه
automatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولGrammar-Guided Genetic Programming
INTRODUCTION Evolutionary computation (EC) is the study of computational systems that borrow ideas from and are inspired by natural evolution and adaptation (Yao & Xu, 2006, pp. 1-18). EC covers a number of techniques based on evolutionary processes and natural selection: evolutionary strategies, genetic algorithms and genetic programming (Keedwell & Narayanan, 2005). Evolutionary strategies ar...
متن کاملAutomatic Generation of Prime Factorization Algorithms Using Genetic Programming
This paper describes the application of the principles of genetic programming to the field of prime factorization. Any prime factorization algorithm is given one integer and must generate a complete list of primes such that, when multiplied together in varying degrees, produces the original integer. Constructing even a limited factoring algorithm in GP turns out to be extremely challenging and ...
متن کاملTowards the automatic generation of card games through grammar-guided genetic programming
We demonstrate generating complete and playable card games using evolutionary algorithms. Card games are represented in a previously devised card game description language, a context-free grammar. The syntax of this language allows us to use grammar-guided genetic programming. Candidate card games are evaluated through a cascading evaluation function, a multi-step process where games with undes...
متن کاملGrammar Generation with Genetic Programming
External domain specific languages are ubiquitous in computer science. Getting ahold of definitions of these languages and being able to analyze them is difficult. The code has to be parsed and transformed to a model before we can even start to retrieve meaningful information. Often a parser is not openly available or is written in an other language. Hence a developer analyzing the code has to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2021
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2021.105364